Stable and semi-stable unicyclic graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-Stable Semantics

In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that for finite argumentation frameworks there always exists at least one semi-stable extension. Furthermore, if there a...

متن کامل

Semi - Stable Semantics 1

In this paper, we examine an argument-based semantics called semistable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that there exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, th...

متن کامل

Quasi-semi-stable representations

Fix K a p-adic field and denote by GK its absolute Galois group. Let K∞ be the extension of K obtained by adding p-th roots of a fixed uniformizer, and G∞ ⊂ GK its absolute Galois group. In this article, we define a class of p-adic torsion representations of G∞, named quasi-semi-stable. We prove that these representations are “explicitly” described by a certain category of linear algebra object...

متن کامل

Stable Equimatchable Graphs

A graph G is equimatchable if every maximal matching of G has the same cardinality. We are interested in equimatchable graphs such that the removal of any edge from the graph preserves the equimatchability. We call an equimatchable graph G edge-stable if G\e is equimatchable for any e ∈ E(G). After noticing that edge-stable equimatchable graphs are either 2-connected factor-critical or bipartit...

متن کامل

Stable properties of graphs

143 Hasratian, A.S. and N.K. Khachatrian, Stable properties of graphs, Discrete Mathematics 90 (1991) 143-152. For many properties P Bondy and Chvatal (1976) have found sufficient conditions such that if a graph G + uv has property P then G itself has property P. In this paper we will give a generalization that will improve ten of these conditions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1974

ISSN: 0012-365X

DOI: 10.1016/0012-365x(74)90010-7